A Taxonomy for Multi-Period Resource Allocation Problems at System Edges (MPRASE Taxonomy)

نویسندگان

  • Oliver Heckmann
  • Jens Schmitt
چکیده

Providing guaranteed QoS, be it statistical or deterministic, necessarily requires allocation of scarce resources. This might happen on a session or on an aggregate basis, nevertheless, it is conceivable that at least at system edges scarcity of resources, exposed in the form of non-negligible (virtual) costs, will prevail to necessitate explicit allocation of resources as opposed to pure overdimensioning. An example of this logic is constituted by the Differentiated Services (DiffServ) architecture which is largely based on explicit bilateral Service Level Agreements (SLA) between peering providers. Often such resource allocation decisions are done on a multi-period basis because resource allocation decisions at a certain point in time may depend on earlier decisions and thus it can turn out sub-optimal to look at decisions in an isolated fashion. In earlier papers we discussed the general class of optimization problems that are applicable in these scenarios. We call the class MPRASE (Multi-Period Resource Allocation at System Edges). In this paper we present a taxonomy for all the MPRASE problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

- Period Resource Allocation at Sys

The Internet consists of a variety of interconnected heterogeneous networks managed by independent providers. At the edges between two networks resources are allocated. In this paper, we present a framework and taxonomy for problems at these edges like admission control and provider selection; we call them multi-period resource allocation problems at system edges (MPRASE). We look at several pr...

متن کامل

Multi-Period Resource Allocation at System Edges -- Capacity Management in a Multi-Provider Multi-Service Internet

Providing guaranteed QoS necessarily requires allocation of scarce resources. It is conceivable that at least at system edges scarcity of resources, exposed in the form of non-negligible (virtual) costs, will prevail to necessitate explicit allocation of resources as opposed to pure overdimensioning. An example of this logic is constituted by the Differentiated Services (DiffServ) architecture....

متن کامل

The Token Bucket Allocation and Reallocation Problems ( MPRASE Token Bucket )

This paper deals with the dimensioning of token buckets. Two related problems are formulated and solved. The first is the token bucket allocation problem (TBAP) which is finding the cost-minimal token bucket for the transmission of a given VBR traffic stream, e.g. an MPEG movie, from the user's point of view. This problem has been treated in literature before but as we will show not completely....

متن کامل

A comprehensive taxonomy for multi-robot task allocation

Task allocation is an important aspect of many multi-robot systems. The features and complexity of multi-robot task allocation (MRTA) problems are dictated by the requirements of the particular domain under consideration. These problems can range from those involving instantaneous distribution of simple, independent tasks among members of a homogenous team, to those requiring the time-extended ...

متن کامل

A taxonomy for task allocation problems with temporal and ordering constraints

Previous work on assigning tasks to robots has proposed extensive categorizations of allocation of tasks with and without constraints. The main contribution of this paper is a more specific categorization of problems that have both temporal and ordering constraints. We propose a novel taxonomy that builds on the existing taxonomy for multi-robot task allocation and organizes the current literat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001